list = [[],
[],
[]]
n = int(input())
count = 0
for i in range(n):
c = 0
a = input().split()
for j in range(len(a)):
a[j] = int(a[j])
for j in range(3):
list[j].append(a[j])
if list[j][i] == 1:
c += 1
if c > 1:
count += 1
print(count)
#include <iostream>
using namespace std;
int main(){
int n=0,y=0;
cin>>n;
int x[n][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>x[i][j];}}
for(int i=0;i<n;i++){
if ((x[i][0]==1&&x[i][1]==1)||(x[i][0]==1&&x[i][2]==1)||(x[i][1]==1&&x[i][2]==1))
y+=1;
}
cout<<y;
return 0;
}1480. Running Sum of 1d Array | 682. Baseball Game |
496. Next Greater Element I | 232. Implement Queue using Stacks |
844. Backspace String Compare | 20. Valid Parentheses |
746. Min Cost Climbing Stairs | 392. Is Subsequence |
70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |
1526A - Mean Inequality | 1526B - I Hate 1111 |
1881. Maximum Value after Insertion | 237. Delete Node in a Linked List |
27. Remove Element | 39. Combination Sum |
378. Kth Smallest Element in a Sorted Matrix | 162. Find Peak Element |